Ant Algorithms Solve Difficult Optimization Problems
نویسنده
چکیده
The ant algorithms research field builds on the idea that the study of the behavior of ant colonies or other social insects is interesting for computer scientists, because it provides models of distributed organization that can be used as a source of inspiration for the design of optimization and distributed control algorithms. In this paper we overview this growing research field, giving particular attention to ant colony optimization, the currently most successful example of ant algorithms, as well as to some other promising directions such as ant algorithms inspired by labor division and brood sorting.
منابع مشابه
New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملPERFORMANCE OF DIFFERENT ANT-BASED ALGORITHMS FOR OPTIMIZATION OF MIXED VARIABLE DOMAIN IN CIVIL ENGINEERING DESIGNS
Ant colony optimization algorithms (ACOs) have been basically introduced to discrete variable problems and applied to different research domains in several engineering fields. Meanwhile, abundant studies have been already involved to adapt different ant models to continuous search spaces. Assessments indicate competitive performance of ACOs on discrete or continuous domains. Therefore, as poten...
متن کاملConstraint Cellular Ant Algorithm for the Multi-Objective Vehicle Routing Problem
Constraint Cellular ant algorithm is a new optimization method for solving real problems by using both constraints method, the evolutionary rule of cellular, graph theory and the characteristics of ant colony optimization. Multi-objective vehicle routing problem is very important and practical in logistic research fields, but it is difficult to model and solve because objectives have complicate...
متن کاملParallel Ant Colonies for Combinatorial Optimization Problems
Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem (QAP). Parallelism demonstrates that cooperation between communicating agents improve the obtained results in solving the QAP. It demonstrates also that high-performance computing is...
متن کاملPerformance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem
Most real world combinatorial optimization problems are difficult to solve with multiple objectives which have to be optimized simultaneously. Over the last few years, researches have been proposed several ant colony optimization algorithms to solve multiple objectives. The aim of this paper is to review the recently proposed multi-objective ant colony optimization (MOACO) algorithms and compar...
متن کامل